Fast and Robust Information Spreading
نویسندگان
چکیده
Disseminating information in large networks of distributed systems is a fundamental problem. The classical randomized protocol, where in each round every node chooses a random neighbor to exchange information with, is an attractive solution for its simplicity, robustness to failures, and efficiency for many topologies. However, since the running time of this protocol depends on the expansion of the network, there are topologies for which it is very inefficient, requiring a number of rounds significantly larger than the diameter (polynomial in the number of nodes, for networks with constant diameter). Recently, a new generation of randomized protocols have been proposed [3, 4], which provide stronger runtime guarantees achieving a number of rounds close to the diameter. However, it seems that these protocols are less robust, even against modest network changes or failures. In this paper we present a randomized information spreading algorithm that has runtime comparable to the newer algorithms, namely O(D · polylog(n)) rounds for any network with n nodes and diameter D, and is provably robust for various random failure models, similarly to the classical randomized protocol. Our algorithm relies on solving the Neighbor Exchange Problem [3], where each node must learn the information stored in each of its neighbors. The algorithm is simple and natural, and its main innovation is that nodes choose the neighbor to contact in each round with probability that decreases with the number of messages they have received originating from that neighbor. ∗Supported by the Simons Postdoctoral Fellows Program and NSF Award 0939370-CCF.
منابع مشابه
A Quasirandom Rumor Spreading
Randomized rumor spreading or random phone call protocols are simple randomized epidemic algorithms designed to distribute a piece of information in a network. They build on the basic paradigm that informed vertices call random neighbors to inform them (push model), or that uninformed vertices call random neighbors to become informed if the neighbor is (pull model). Despite the simple concept, ...
متن کاملDecision support system (DSS) for site selection floodwater spreading schemes using remote sensing (RS) and geographical information systems (GIS)
متن کامل
Fast Information Spreading in Graphs with a Large Weak Conductance
Gathering data from nodes in a network is at the heart of many distributed applications, most notably, while performing a global task. We consider information spreading among n nodes of a network, where each node v has a message m(v) which must be received by all other nodes. The time required for information spreading has been previously upper-bounded with an inverse relationship to the conduc...
متن کاملEfficient reconstruction of transmission probabilities in a spreading process from partial observations
An important problem of reconstruction of diffusion network and transmission probabilities from the data has attracted a considerable attention in the past several years. A number of recent papers introduced efficient algorithms for the estimation of spreading parameters, based on the maximization of the likelihood of observed cascades, assuming that the full information for all the nodes in th...
متن کاملA Robust Adaptive Observer-Based Time Varying Fault Estimation
This paper presents a new observer design methodology for a time varying actuator fault estimation. A new linear matrix inequality (LMI) design algorithm is developed to tackle the limitations (e.g. equality constraint and robustness problems) of the well known so called fast adaptive fault estimation observer (FAFE). The FAFE is capable of estimating a wide range of time-varying actuator fault...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012